Approximating Steiner trees
نویسندگان
چکیده
We give a presentation of Robins and Zelikovsky’s 1.55 approximation algorithm to the Steiner Tree Problem and a thorough proof of its approximation ratio. Furthermore we sketch a proof by Thimm bounding the approximability of the Steiner Tree Problem.
منابع مشابه
Approximating Minimum Steiner Point Trees in Minkowski
Given a set of points, we define a minimum Steiner point tree to be a tree interconnecting these points and possibly some additional points such that the length of every edge is at most 1 and the number of additional points is minimized. We propose using Steiner minimal trees to approximate minimum Steiner point trees. It is shown that in arbitrary metric spaces this gives a performance differe...
متن کاملApproximating minimum Steiner point trees in Minkowski planes
Given a set of points, we define a minimum Steiner point tree to be a tree interconnecting these points and possibly some additional points such that the length of every edge is at most 1 and the number of additional points is minimized. We propose using Steiner minimal trees to approximate minimum Steiner point trees. It is shown that in arbitrary metric spaces this gives a performance differe...
متن کاملApproximating the Weight of Shallow Steiner Trees
This paper deals with the problem of constructing Steiner trees of minimum weight with diameter bounded by d, spanning a given set of vertices in a graph. Exact solutions or logarithmic ratio approximation algorithms were known before for the cases of d 5. Here we give a polynomial time approximation algorithm of ratio O(log) for constant d, which is asymptotically optimal unless P = N P , and ...
متن کاملApproximation Algorithms for Facility Location with Capacitated and Length-Bounded Tree Connections
We consider a generalization of the uncapacitated facility location problem that occurs in planning of optical access networks in telecommunications. Clients are connected to open facilities via depthbounded trees. The total demand of clients served by a tree must not exceed a given tree capacity. We investigate a framework for combining facility location algorithms with a tree-based clustering...
متن کاملA note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points
We give a tight analysis of the MST heuristic recently introduced by G.-H. Lin and G. Xue for approximating the Steiner tree with minimum number of Steiner points and bounded edge-lengths. The approximation factor of the heuristic is shown to be one less than the MST number of the underlying space, de ned as the maximum possible degree of a minimum-degree MST spanning points from the space. In ...
متن کامل